Preference Restrictions in Computational Social Choice: Recent Progress

نویسندگان

  • Edith Elkind
  • Martin Lackner
  • Dominik Peters
چکیده

The goal of this short paper is to provide an overview of recent progress in understanding and exploiting useful properties of restricted preference domains, such as, e.g., the domains of singlepeaked, single-crossing and 1-Euclidean preferences.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Likelihood of Structure in Preference Profiles

In the field of computational social choice, structure in preferences is often described by so-called domain restrictions. Domain restrictions are of major importance since they allow for the circumvention of Arrow’s paradox and for faster algorithms. On the other hand, such structure might be disadvantageous if one seeks to protect voting mechanisms against manipulation and control with the he...

متن کامل

Computational Models of Cultural Behavior for Human-Agent Interaction (Dagstuhl Seminar 14131)

This report documents the program and the outcomes of Dagstuhl Seminar 14101 “Preference Learning”. Preferences have recently received considerable attention in disciplines such as machine learning, knowledge discovery, information retrieval, statistics, social choice theory, multiple criteria decision making, decision under risk and uncertainty, operations research, and others. The motivation ...

متن کامل

Computational Social Choice in the Clouds

In the era of big data we are concerned with solving computational problems on huge datasets. To handle huge datasets in cloud systems dedicated programming frameworks are used, among which MapReduce is the most widely employed. It is an important issue in many application areas to design parallel algorithms which can be executed efficiently on cloud systems and can cope with big data. In compu...

متن کامل

Computational Social Choice: The First Ten Years and Beyond

Computational social choice is a research area at the intersection of computer science, mathematics, and economics that is concerned with aggregation of preferences of multiple agents. Typical applications include voting, resource allocation, and fair division. This chapter highlights six representative research areas in contemporary computational social choice: restricted preference domains, v...

متن کامل

Preference Learning 1 Executive Summary

This report documents the program and the outcomes of Dagstuhl Seminar 14101 “Preference Learning”. Preferences have recently received considerable attention in disciplines such as machine learning, knowledge discovery, information retrieval, statistics, social choice theory, multiple criteria decision making, decision under risk and uncertainty, operations research, and others. The motivation ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016